package BinarySearchTree;


	/**
	 *  --Node-- 
   The binary tree is built using this nested node class. 
   Each node stores one data element, and has left and right 
   sub-tree pointer which may be null. 
   The node is a "dumb" nested class -- we just use it for 
   storage; it does not have any methods. 
	 */
	

public class Node {
	//root node pointer. Will be null for an empty tree.
	
		Node left;
		Node right;
		int data;
	//consturctor	
		Node(int newData){
			left = null;
			right = null;
			data=newData;
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}
